<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Doxygen: pcl::segmentation::grabcut::BoykovKolmogorov类 参考</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Doxygen
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'搜索','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',true,false,'search.php','搜索');
  $(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="summary">
<a href="#pub-types">Public 类型</a> &#124;
<a href="#pub-methods">Public 成员函数</a> &#124;
<a href="#pro-types">Protected 类型</a> &#124;
<a href="#pro-methods">Protected 成员函数</a> &#124;
<a href="#pro-attribs">Protected 属性</a> &#124;
<a href="#pri-attribs">Private 属性</a> &#124;
<a href="#pri-static-attribs">静态 Private 属性</a> &#124;
<a href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov-members.html">所有成员列表</a>  </div>
  <div class="headertitle">
<div class="title">pcl::segmentation::grabcut::BoykovKolmogorov类 参考</div>  </div>
</div><!--header-->
<div class="contents">

<p><code>#include &lt;<a class="el" href="grabcut__segmentation_8h_source.html">grabcut_segmentation.h</a>&gt;</code></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public 类型</h2></td></tr>
<tr class="memitem:a464bfe9797f791ea91ec7df3e2712642"><td class="memItemLeft" align="right" valign="top"><a id="a464bfe9797f791ea91ec7df3e2712642"></a>
typedef int&#160;</td><td class="memItemRight" valign="bottom"><b>vertex_descriptor</b></td></tr>
<tr class="separator:a464bfe9797f791ea91ec7df3e2712642"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a05dce391d8ad9b63d7c332d9652485de"><td class="memItemLeft" align="right" valign="top"><a id="a05dce391d8ad9b63d7c332d9652485de"></a>
typedef double&#160;</td><td class="memItemRight" valign="bottom"><b>edge_capacity_type</b></td></tr>
<tr class="separator:a05dce391d8ad9b63d7c332d9652485de"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public 成员函数</h2></td></tr>
<tr class="memitem:a8903c612c1168079a47bf2cb0ff5f8c7"><td class="memItemLeft" align="right" valign="top"><a id="a8903c612c1168079a47bf2cb0ff5f8c7"></a>
&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a8903c612c1168079a47bf2cb0ff5f8c7">BoykovKolmogorov</a> (std::size_t max_nodes=0)</td></tr>
<tr class="memdesc:a8903c612c1168079a47bf2cb0ff5f8c7"><td class="mdescLeft">&#160;</td><td class="mdescRight">construct a maxflow/mincut problem with estimated max_nodes <br /></td></tr>
<tr class="separator:a8903c612c1168079a47bf2cb0ff5f8c7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1ad7468a502d40ccd9ee8ef44ef04eea"><td class="memItemLeft" align="right" valign="top"><a id="a1ad7468a502d40ccd9ee8ef44ef04eea"></a>
virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a1ad7468a502d40ccd9ee8ef44ef04eea">~BoykovKolmogorov</a> ()</td></tr>
<tr class="memdesc:a1ad7468a502d40ccd9ee8ef44ef04eea"><td class="mdescLeft">&#160;</td><td class="mdescRight">destructor <br /></td></tr>
<tr class="separator:a1ad7468a502d40ccd9ee8ef44ef04eea"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a62d106c586c83e9005302de2368f84da"><td class="memItemLeft" align="right" valign="top"><a id="a62d106c586c83e9005302de2368f84da"></a>
size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a62d106c586c83e9005302de2368f84da">numNodes</a> () const</td></tr>
<tr class="memdesc:a62d106c586c83e9005302de2368f84da"><td class="mdescLeft">&#160;</td><td class="mdescRight">get number of nodes in the graph <br /></td></tr>
<tr class="separator:a62d106c586c83e9005302de2368f84da"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4337b04c14ebfba5b3b4563706c6737f"><td class="memItemLeft" align="right" valign="top"><a id="a4337b04c14ebfba5b3b4563706c6737f"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a4337b04c14ebfba5b3b4563706c6737f">reset</a> ()</td></tr>
<tr class="memdesc:a4337b04c14ebfba5b3b4563706c6737f"><td class="mdescLeft">&#160;</td><td class="mdescRight">reset all edge capacities to zero (but don't free the graph) <br /></td></tr>
<tr class="separator:a4337b04c14ebfba5b3b4563706c6737f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8575f4bd3e4d4d506aab2c54e4a5e72e"><td class="memItemLeft" align="right" valign="top"><a id="a8575f4bd3e4d4d506aab2c54e4a5e72e"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a8575f4bd3e4d4d506aab2c54e4a5e72e">clear</a> ()</td></tr>
<tr class="memdesc:a8575f4bd3e4d4d506aab2c54e4a5e72e"><td class="mdescLeft">&#160;</td><td class="mdescRight">clear the graph and internal datastructures <br /></td></tr>
<tr class="separator:a8575f4bd3e4d4d506aab2c54e4a5e72e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab6d400905673c4b9ec935a44791c01a3"><td class="memItemLeft" align="right" valign="top"><a id="ab6d400905673c4b9ec935a44791c01a3"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#ab6d400905673c4b9ec935a44791c01a3">addNodes</a> (std::size_t n=1)</td></tr>
<tr class="memdesc:ab6d400905673c4b9ec935a44791c01a3"><td class="mdescLeft">&#160;</td><td class="mdescRight">add nodes to the graph (returns the id of the first node added) <br /></td></tr>
<tr class="separator:ab6d400905673c4b9ec935a44791c01a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acacea870da92b1a569a69a4c09511358"><td class="memItemLeft" align="right" valign="top"><a id="acacea870da92b1a569a69a4c09511358"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#acacea870da92b1a569a69a4c09511358">addConstant</a> (double c)</td></tr>
<tr class="memdesc:acacea870da92b1a569a69a4c09511358"><td class="mdescLeft">&#160;</td><td class="mdescRight">add constant flow to graph <br /></td></tr>
<tr class="separator:acacea870da92b1a569a69a4c09511358"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1f1f79e64c2c3d8cce48c6cf6dec8d63"><td class="memItemLeft" align="right" valign="top"><a id="a1f1f79e64c2c3d8cce48c6cf6dec8d63"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a1f1f79e64c2c3d8cce48c6cf6dec8d63">addSourceEdge</a> (int u, double cap)</td></tr>
<tr class="memdesc:a1f1f79e64c2c3d8cce48c6cf6dec8d63"><td class="mdescLeft">&#160;</td><td class="mdescRight">add edge from s to nodeId <br /></td></tr>
<tr class="separator:a1f1f79e64c2c3d8cce48c6cf6dec8d63"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a223cd3eb267bb2dbbc1233c3c9fc23b1"><td class="memItemLeft" align="right" valign="top"><a id="a223cd3eb267bb2dbbc1233c3c9fc23b1"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a223cd3eb267bb2dbbc1233c3c9fc23b1">addTargetEdge</a> (int u, double cap)</td></tr>
<tr class="memdesc:a223cd3eb267bb2dbbc1233c3c9fc23b1"><td class="mdescLeft">&#160;</td><td class="mdescRight">add edge from nodeId to t <br /></td></tr>
<tr class="separator:a223cd3eb267bb2dbbc1233c3c9fc23b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aed1c7994a1ab333673043375276619dd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#aed1c7994a1ab333673043375276619dd">addEdge</a> (int u, int v, double cap_uv, double cap_vu=0.0)</td></tr>
<tr class="separator:aed1c7994a1ab333673043375276619dd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa934e5f0053cce97093f5dd97f2a1980"><td class="memItemLeft" align="right" valign="top"><a id="aa934e5f0053cce97093f5dd97f2a1980"></a>
double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#aa934e5f0053cce97093f5dd97f2a1980">solve</a> ()</td></tr>
<tr class="memdesc:aa934e5f0053cce97093f5dd97f2a1980"><td class="mdescLeft">&#160;</td><td class="mdescRight">solve the max-flow problem and return the flow <br /></td></tr>
<tr class="separator:aa934e5f0053cce97093f5dd97f2a1980"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a06dfdb9ddf8f184ded86fb58a3dbd445"><td class="memItemLeft" align="right" valign="top"><a id="a06dfdb9ddf8f184ded86fb58a3dbd445"></a>
bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a06dfdb9ddf8f184ded86fb58a3dbd445">inSourceTree</a> (int u) const</td></tr>
<tr class="memdesc:a06dfdb9ddf8f184ded86fb58a3dbd445"><td class="mdescLeft">&#160;</td><td class="mdescRight">return true if <code>u</code> is in the s-set after calling <a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#aa934e5f0053cce97093f5dd97f2a1980">solve</a>. <br /></td></tr>
<tr class="separator:a06dfdb9ddf8f184ded86fb58a3dbd445"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a660e9da2e61c98dccc2d33b29d0791d7"><td class="memItemLeft" align="right" valign="top"><a id="a660e9da2e61c98dccc2d33b29d0791d7"></a>
bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a660e9da2e61c98dccc2d33b29d0791d7">inSinkTree</a> (int u) const</td></tr>
<tr class="memdesc:a660e9da2e61c98dccc2d33b29d0791d7"><td class="mdescLeft">&#160;</td><td class="mdescRight">return true if <code>u</code> is in the t-set after calling <a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#aa934e5f0053cce97093f5dd97f2a1980">solve</a> <br /></td></tr>
<tr class="separator:a660e9da2e61c98dccc2d33b29d0791d7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a68b2eaec251fb41c6a41bffefb66e80b"><td class="memItemLeft" align="right" valign="top"><a id="a68b2eaec251fb41c6a41bffefb66e80b"></a>
double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a68b2eaec251fb41c6a41bffefb66e80b">operator()</a> (int u, int v) const</td></tr>
<tr class="memdesc:a68b2eaec251fb41c6a41bffefb66e80b"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns the residual capacity for an edge (use -1 for terminal (-1,-1) is the current flow <br /></td></tr>
<tr class="separator:a68b2eaec251fb41c6a41bffefb66e80b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5202f4bf1e234cfd52191f96385f7a1b"><td class="memItemLeft" align="right" valign="top"><a id="a5202f4bf1e234cfd52191f96385f7a1b"></a>
double&#160;</td><td class="memItemRight" valign="bottom"><b>getSourceEdgeCapacity</b> (int u) const</td></tr>
<tr class="separator:a5202f4bf1e234cfd52191f96385f7a1b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0c9262da73c75fbb49f770ed800e4ee4"><td class="memItemLeft" align="right" valign="top"><a id="a0c9262da73c75fbb49f770ed800e4ee4"></a>
double&#160;</td><td class="memItemRight" valign="bottom"><b>getTargetEdgeCapacity</b> (int u) const</td></tr>
<tr class="separator:a0c9262da73c75fbb49f770ed800e4ee4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-types"></a>
Protected 类型</h2></td></tr>
<tr class="memitem:a06025d5525ebc5e3e1eaf87d24afb9da"><td class="memItemLeft" align="right" valign="top"><a id="a06025d5525ebc5e3e1eaf87d24afb9da"></a>enum &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a06025d5525ebc5e3e1eaf87d24afb9da">nodestate</a> { <b>FREE</b> = 0x00
, <b>SOURCE</b> = 0x01
, <b>TARGET</b> = 0x02
 }</td></tr>
<tr class="memdesc:a06025d5525ebc5e3e1eaf87d24afb9da"><td class="mdescLeft">&#160;</td><td class="mdescRight">tree states <br /></td></tr>
<tr class="separator:a06025d5525ebc5e3e1eaf87d24afb9da"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adee34f9ab647ace5b14822ff434d72fb"><td class="memItemLeft" align="right" valign="top"><a id="adee34f9ab647ace5b14822ff434d72fb"></a>
typedef std::map&lt; int, double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#adee34f9ab647ace5b14822ff434d72fb">capacitated_edge</a></td></tr>
<tr class="memdesc:adee34f9ab647ace5b14822ff434d72fb"><td class="mdescLeft">&#160;</td><td class="mdescRight">capacitated edge <br /></td></tr>
<tr class="separator:adee34f9ab647ace5b14822ff434d72fb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4915233eba8ce733879883f043355a9a"><td class="memItemLeft" align="right" valign="top"><a id="a4915233eba8ce733879883f043355a9a"></a>
typedef std::pair&lt; capacitated_edge::iterator, capacitated_edge::iterator &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a4915233eba8ce733879883f043355a9a">edge_pair</a></td></tr>
<tr class="memdesc:a4915233eba8ce733879883f043355a9a"><td class="mdescLeft">&#160;</td><td class="mdescRight">edge pair <br /></td></tr>
<tr class="separator:a4915233eba8ce733879883f043355a9a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-methods"></a>
Protected 成员函数</h2></td></tr>
<tr class="memitem:a00f1d195d1e804fb5109c345d97a6806"><td class="memItemLeft" align="right" valign="top"><a id="a00f1d195d1e804fb5109c345d97a6806"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a00f1d195d1e804fb5109c345d97a6806">preAugmentPaths</a> ()</td></tr>
<tr class="memdesc:a00f1d195d1e804fb5109c345d97a6806"><td class="mdescLeft">&#160;</td><td class="mdescRight">pre-augment s-u-t and s-u-v-t paths <br /></td></tr>
<tr class="separator:a00f1d195d1e804fb5109c345d97a6806"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ace0c1b72070cea507cb09433fb877d79"><td class="memItemLeft" align="right" valign="top"><a id="ace0c1b72070cea507cb09433fb877d79"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#ace0c1b72070cea507cb09433fb877d79">initializeTrees</a> ()</td></tr>
<tr class="memdesc:ace0c1b72070cea507cb09433fb877d79"><td class="mdescLeft">&#160;</td><td class="mdescRight">initialize trees from source and target <br /></td></tr>
<tr class="separator:ace0c1b72070cea507cb09433fb877d79"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a61161a98ff353bf410c377cd6237b014"><td class="memItemLeft" align="right" valign="top"><a id="a61161a98ff353bf410c377cd6237b014"></a>
std::pair&lt; int, int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a61161a98ff353bf410c377cd6237b014">expandTrees</a> ()</td></tr>
<tr class="memdesc:a61161a98ff353bf410c377cd6237b014"><td class="mdescLeft">&#160;</td><td class="mdescRight">expand trees until a path is found (or no path (-1, -1)) <br /></td></tr>
<tr class="separator:a61161a98ff353bf410c377cd6237b014"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a304cea3dae4656b0e48617a27b78be73"><td class="memItemLeft" align="right" valign="top"><a id="a304cea3dae4656b0e48617a27b78be73"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a304cea3dae4656b0e48617a27b78be73">augmentPath</a> (const std::pair&lt; int, int &gt; &amp;path, std::deque&lt; int &gt; &amp;orphans)</td></tr>
<tr class="memdesc:a304cea3dae4656b0e48617a27b78be73"><td class="mdescLeft">&#160;</td><td class="mdescRight">augment the path found by expandTrees; return orphaned subtrees <br /></td></tr>
<tr class="separator:a304cea3dae4656b0e48617a27b78be73"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa87830572e5d176fc9b93a59b0e78b1b"><td class="memItemLeft" align="right" valign="top"><a id="aa87830572e5d176fc9b93a59b0e78b1b"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#aa87830572e5d176fc9b93a59b0e78b1b">adoptOrphans</a> (std::deque&lt; int &gt; &amp;orphans)</td></tr>
<tr class="memdesc:aa87830572e5d176fc9b93a59b0e78b1b"><td class="mdescLeft">&#160;</td><td class="mdescRight">adopt orphaned subtrees <br /></td></tr>
<tr class="separator:aa87830572e5d176fc9b93a59b0e78b1b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8e19d27bfcc7783a8973140dbbd86e9c"><td class="memItemLeft" align="right" valign="top"><a id="a8e19d27bfcc7783a8973140dbbd86e9c"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a8e19d27bfcc7783a8973140dbbd86e9c">clearActive</a> ()</td></tr>
<tr class="memdesc:a8e19d27bfcc7783a8973140dbbd86e9c"><td class="mdescLeft">&#160;</td><td class="mdescRight">clear active set <br /></td></tr>
<tr class="separator:a8e19d27bfcc7783a8973140dbbd86e9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a50d1dfc59492d885bcdc9acfb6b51fb4"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a50d1dfc59492d885bcdc9acfb6b51fb4">isActiveSetEmpty</a> () const</td></tr>
<tr class="separator:a50d1dfc59492d885bcdc9acfb6b51fb4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a429cf2fb98ced583e26b1b70a4f5d350"><td class="memItemLeft" align="right" valign="top"><a id="a429cf2fb98ced583e26b1b70a4f5d350"></a>
bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a429cf2fb98ced583e26b1b70a4f5d350">isActive</a> (int u) const</td></tr>
<tr class="memdesc:a429cf2fb98ced583e26b1b70a4f5d350"><td class="mdescLeft">&#160;</td><td class="mdescRight">active if head or previous node is not the terminal <br /></td></tr>
<tr class="separator:a429cf2fb98ced583e26b1b70a4f5d350"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2b2b7c5eadacba3f73477771611c8e44"><td class="memItemLeft" align="right" valign="top"><a id="a2b2b7c5eadacba3f73477771611c8e44"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a2b2b7c5eadacba3f73477771611c8e44">markActive</a> (int u)</td></tr>
<tr class="memdesc:a2b2b7c5eadacba3f73477771611c8e44"><td class="mdescLeft">&#160;</td><td class="mdescRight">mark vertex as active <br /></td></tr>
<tr class="separator:a2b2b7c5eadacba3f73477771611c8e44"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a60f4052e843bad644d30f47f84bca564"><td class="memItemLeft" align="right" valign="top"><a id="a60f4052e843bad644d30f47f84bca564"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a60f4052e843bad644d30f47f84bca564">markInactive</a> (int u)</td></tr>
<tr class="memdesc:a60f4052e843bad644d30f47f84bca564"><td class="mdescLeft">&#160;</td><td class="mdescRight">mark vertex as inactive <br /></td></tr>
<tr class="separator:a60f4052e843bad644d30f47f84bca564"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-attribs"></a>
Protected 属性</h2></td></tr>
<tr class="memitem:aefc40a1c6479d676cc99161243319aa9"><td class="memItemLeft" align="right" valign="top"><a id="aefc40a1c6479d676cc99161243319aa9"></a>
std::vector&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#aefc40a1c6479d676cc99161243319aa9">source_edges_</a></td></tr>
<tr class="memdesc:aefc40a1c6479d676cc99161243319aa9"><td class="mdescLeft">&#160;</td><td class="mdescRight">edges leaving the source <br /></td></tr>
<tr class="separator:aefc40a1c6479d676cc99161243319aa9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a572dceff93c2aec0c50b3215e902c53c"><td class="memItemLeft" align="right" valign="top"><a id="a572dceff93c2aec0c50b3215e902c53c"></a>
std::vector&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a572dceff93c2aec0c50b3215e902c53c">target_edges_</a></td></tr>
<tr class="memdesc:a572dceff93c2aec0c50b3215e902c53c"><td class="mdescLeft">&#160;</td><td class="mdescRight">edges entering the target <br /></td></tr>
<tr class="separator:a572dceff93c2aec0c50b3215e902c53c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a29f92fe3de2e36ace334802f9bd82eab"><td class="memItemLeft" align="right" valign="top"><a id="a29f92fe3de2e36ace334802f9bd82eab"></a>
std::vector&lt; <a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#adee34f9ab647ace5b14822ff434d72fb">capacitated_edge</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a29f92fe3de2e36ace334802f9bd82eab">nodes_</a></td></tr>
<tr class="memdesc:a29f92fe3de2e36ace334802f9bd82eab"><td class="mdescLeft">&#160;</td><td class="mdescRight">nodes and their outgoing internal edges <br /></td></tr>
<tr class="separator:a29f92fe3de2e36ace334802f9bd82eab"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0391da5166a52b7dc3c07dad3630650a"><td class="memItemLeft" align="right" valign="top"><a id="a0391da5166a52b7dc3c07dad3630650a"></a>
double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a0391da5166a52b7dc3c07dad3630650a">flow_value_</a></td></tr>
<tr class="memdesc:a0391da5166a52b7dc3c07dad3630650a"><td class="mdescLeft">&#160;</td><td class="mdescRight">current flow value (includes constant) <br /></td></tr>
<tr class="separator:a0391da5166a52b7dc3c07dad3630650a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a12a00bbbbec04bddc5a4b109bf1caa50"><td class="memItemLeft" align="right" valign="top"><a id="a12a00bbbbec04bddc5a4b109bf1caa50"></a>
std::vector&lt; unsigned char &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a12a00bbbbec04bddc5a4b109bf1caa50">cut_</a></td></tr>
<tr class="memdesc:a12a00bbbbec04bddc5a4b109bf1caa50"><td class="mdescLeft">&#160;</td><td class="mdescRight">identifies which side of the cut a node falls <br /></td></tr>
<tr class="separator:a12a00bbbbec04bddc5a4b109bf1caa50"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private 属性</h2></td></tr>
<tr class="memitem:a623178a7d87583cd117f902512b6bc7a"><td class="memItemLeft" align="right" valign="top"><a id="a623178a7d87583cd117f902512b6bc7a"></a>
std::vector&lt; std::pair&lt; int, <a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a4915233eba8ce733879883f043355a9a">edge_pair</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a623178a7d87583cd117f902512b6bc7a">parents_</a></td></tr>
<tr class="memdesc:a623178a7d87583cd117f902512b6bc7a"><td class="mdescLeft">&#160;</td><td class="mdescRight">search tree (also uses cut_) <br /></td></tr>
<tr class="separator:a623178a7d87583cd117f902512b6bc7a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa41db19528abf4be9b162524086d5ab6"><td class="memItemLeft" align="right" valign="top"><a id="aa41db19528abf4be9b162524086d5ab6"></a>
std::vector&lt; std::pair&lt; int, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#aa41db19528abf4be9b162524086d5ab6">active_list_</a></td></tr>
<tr class="memdesc:aa41db19528abf4be9b162524086d5ab6"><td class="mdescLeft">&#160;</td><td class="mdescRight">doubly-linked list (prev, next) <br /></td></tr>
<tr class="separator:aa41db19528abf4be9b162524086d5ab6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aac842e19872b10765f6a2e8b79ea7738"><td class="memItemLeft" align="right" valign="top"><a id="aac842e19872b10765f6a2e8b79ea7738"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>active_head_</b></td></tr>
<tr class="separator:aac842e19872b10765f6a2e8b79ea7738"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7e516802e55f21e2f688d74c13cf55bc"><td class="memItemLeft" align="right" valign="top"><a id="a7e516802e55f21e2f688d74c13cf55bc"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>active_tail_</b></td></tr>
<tr class="separator:a7e516802e55f21e2f688d74c13cf55bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-static-attribs"></a>
静态 Private 属性</h2></td></tr>
<tr class="memitem:a6be512418cba4019dcd7d2391915c7c6"><td class="memItemLeft" align="right" valign="top"><a id="a6be512418cba4019dcd7d2391915c7c6"></a>
static const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a6be512418cba4019dcd7d2391915c7c6">TERMINAL</a></td></tr>
<tr class="memdesc:a6be512418cba4019dcd7d2391915c7c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">parents_ flag for terminal state <br /></td></tr>
<tr class="separator:a6be512418cba4019dcd7d2391915c7c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">详细描述</h2>
<div class="textblock"><p>boost implementation of Boykov and Kolmogorov's maxflow algorithm doesn't support negative flows which makes it inappropriate for this conext. This implementation of Boykov and Kolmogorov's maxflow algorithm by Stephen Gould <a href="#" onclick="location.href='mai'+'lto:'+'ste'+'ph'+'en.'+'go'+'uld'+'@a'+'nu.'+'ed'+'u.a'+'u'; return false;">steph<span style="display: none;">.nosp@m.</span>en.g<span style="display: none;">.nosp@m.</span>ould@<span style="display: none;">.nosp@m.</span>anu.<span style="display: none;">.nosp@m.</span>edu.a<span style="display: none;">.nosp@m.</span>u</a> in DARWIN under BSD does the trick however solwer than original implementation. </p>
</div><h2 class="groupheader">成员函数说明</h2>
<a id="aed1c7994a1ab333673043375276619dd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aed1c7994a1ab333673043375276619dd">&#9670;&nbsp;</a></span>addEdge()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void pcl::segmentation::grabcut::BoykovKolmogorov::addEdge </td>
          <td>(</td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>u</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>v</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">double&#160;</td>
          <td class="paramname"><em>cap_uv</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">double&#160;</td>
          <td class="paramname"><em>cap_vu</em> = <code>0.0</code>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>add edge from u to v and edge from v to u (requires cap_uv + cap_vu &gt;= 0) </p>

</div>
</div>
<a id="a50d1dfc59492d885bcdc9acfb6b51fb4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a50d1dfc59492d885bcdc9acfb6b51fb4">&#9670;&nbsp;</a></span>isActiveSetEmpty()</h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool pcl::segmentation::grabcut::BoykovKolmogorov::isActiveSetEmpty </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<dl class="section return"><dt>返回</dt><dd>true if active set is empty </dd></dl>
<div class="fragment"><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;{ <span class="keywordflow">return</span> (active_head_ == <a class="code" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a6be512418cba4019dcd7d2391915c7c6">TERMINAL</a>); }</div>
<div class="ttc" id="aclasspcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov_html_a6be512418cba4019dcd7d2391915c7c6"><div class="ttname"><a href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html#a6be512418cba4019dcd7d2391915c7c6">pcl::segmentation::grabcut::BoykovKolmogorov::TERMINAL</a></div><div class="ttdeci">static const int TERMINAL</div><div class="ttdoc">parents_ flag for terminal state</div><div class="ttdef"><b>Definition:</b> grabcut_segmentation.h:164</div></div>
</div><!-- fragment -->
</div>
</div>
<hr/>该类的文档由以下文件生成:<ul>
<li>segmentation/include/pcl/segmentation/<a class="el" href="grabcut__segmentation_8h_source.html">grabcut_segmentation.h</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><b>pcl</b></li><li class="navelem"><b>segmentation</b></li><li class="navelem"><b>grabcut</b></li><li class="navelem"><a class="el" href="classpcl_1_1segmentation_1_1grabcut_1_1_boykov_kolmogorov.html">BoykovKolmogorov</a></li>
    <li class="footer">制作者 <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
  </ul>
</div>
</body>
</html>
